On amenability of automata groups

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Amenability of Automata Groups

We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability just of a certain explicit family of groups (“Mother groups”) which is done by analyzing the asymptotic properties of random walks on these groups.

متن کامل

Amenability of Groups Acting on Trees

This note describes the first example of a group that is amenable, but cannot be obtained by subgroups, quotients, extensions and direct limits from the class of groups locally of subexponential growth. It has a balanced presentation ∆ = 〈b, t| [b, t]b, [[[b, t], b], b]〉. In the proof, I show that ∆ acts transitively on a 3-regular tree, and that Γ = 〈b, b −1 〉 stabilizes a vertex and acts by r...

متن کامل

Weak amenability of Coxeter groups

Let (G,S) be a Coxeter group. We construct a continuation, to the open unit disc, of the unitary representations associated to the positive definite functions g 7→ rl(g). (Here 0 < r < 1, and l denotes the length function with respect to the generating set S.) The constructed representations are uniformly bounded and we prove that this implies the weak amenability of the group G. Résumé Soit (G...

متن کامل

Weak Amenability of Hyperbolic Groups

We prove that hyperbolic groups are weakly amenable. This partially extends the result of Cowling and Haagerup showing that lattices in simple Lie groups of real rank one are weakly amenable. We take a combinatorial approach in the spirit of Haagerup and prove that for the word length metric d on a hyperbolic group, the Schur multipliers associated with r have uniformly bounded norms for 0 < r ...

متن کامل

Cloud modeling of quasi - order groups on general fuzzy automata

In this paper, first a simplified version of a general fuzzy automaton with a fixed c is defined and then a subepisode of a simplified version of a general fuzzy automaton with a constant c is defined and explained connected and strong connected them, and finally, a model of quasi-order hypergroup on general fuzzy automaton with constant c is presented and the relationships between them are rev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Duke Mathematical Journal

سال: 2010

ISSN: 0012-7094

DOI: 10.1215/00127094-2010-046